Generalizing Bottleneck Problems
نویسندگان
چکیده
Given a pair of random variables (X,Y ) ∼ PXY and two convex functions f1 and f2, we introduce two bottleneck functionals as the lower and upper boundaries of the two-dimensional convex set that consists of the pairs (If1(W ;X), If2(W ;Y )), where If denotes f -information and W varies over the set of all discrete random variables satisfying the Markov condition W → X → Y . Applying Witsenhausen and Wyner’s approach, we provide an algorithm for computing boundaries of this set for f1, f2, and discrete PXY , . In the binary symmetric case, we fully characterize the set when (i) f1(t) = f2(t) = t log t, (ii) f1(t) = f2(t) = t 2 − 1, and (iii) f1 and f2 are both l β norm function for β > 1. We then argue that upper and lower boundaries in (i) correspond to Mrs. Gerber’s Lemma and its inverse (which we call Mr. Gerber’s Lemma), in (ii) correspond to estimation-theoretic variants of Information Bottleneck and Privacy Funnel, and in (iii) correspond to Arimoto Information Bottleneck and Privacy Funnel.
منابع مشابه
A multi Agent System Based on Modified Shifting Bottleneck and Search Techniques for Job Shop Scheduling Problems
This paper presents a multi agent system for the job shop scheduling problems. The proposed system consists of initial scheduling agent, search agents, and schedule management agent. In initial scheduling agent, a modified Shifting Bottleneck is proposed. That is, an effective heuristic approach and can generate a good solution in a low computational effort. In search agents, a hybrid search ap...
متن کاملA new heuristic approach to solve product mix problems in a multi-bottleneck system
Product mix problem (PMP) is one of the most important and complicated problems in production systems. Different approaches have been applied to solve this problem, among them, theory of constraints (TOC) has been widely considered since 1990s. This paper develops a distinguished algorithm to solve product mix prob-lems that is efficient both in single and multi-bottleneck problems. At first, t...
متن کاملSolving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm
In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...
متن کاملSolving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm
The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...
متن کاملAsymptotically Optimal Heuristics for Bottleneck and Capacity Optimization Problems
Our goal is to design simple and asymptotically optimal heuristic algorithms for a class of bottleneck and capacity optimization problems. Our approach is applied to a wide variety of bottleneck problems including vehicle routing problems, location problems, and communication network problems. In particular, we present simple and asymptotically optimal heuristic algorithms that solve the bottle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1802.05861 شماره
صفحات -
تاریخ انتشار 2018